-
1 vertex-weighted graph
граф со взвешенными вершинами
—
[Л.Г.Суменко. Англо-русский словарь по информационным технологиям. М.: ГП ЦНИИС, 2003.]Тематики
EN
Англо-русский словарь нормативно-технической терминологии > vertex-weighted graph
-
2 vertex-weighted graph
graph features — свойства графа; теоретико-графовые свойства
computation graph — вычислительный граф; граф вычислений
product graph — произведение графов; граф-произведение
-
3 vertex-weighted graph
граф со взвешенными вершинамиБольшой англо-русский и русско-английский словарь > vertex-weighted graph
-
4 vertex-weighted graph
Вычислительная техника: граф со взвешенными вершинами -
5 vertex-weighted graph
English-Russian dictionary of computer science and programming > vertex-weighted graph
-
6 vertex-weighted graph
English-Russian information technology > vertex-weighted graph
-
7 graph
1) график; диаграмма; кривая; номограмма2) граф3) лингв. вариант графемы•- acyclic graph
- alternating graph
- AND-OR graph
- bar graph - bipartite graph
- bunch graph
- Caley graph
- circuit-free graph
- circulant graph
- circular graph
- closed graph
- color graph
- complementary graph
- complete graph
- computation graph
- connected graph
- connectivity graph
- control flow graph
- data flow program graph
- data-flow graph - directed graph
- E-graph
- extremal graph
- finite graph
- flat graph
- flow graph
- game graph
- harward graph
- indirected graph
- infinite graph
- information graph
- irregular graph
- labeled graph
- line graph
- linear graph
- locally finite graph
- marked points graph
- monochromatic graph
- multidimensional graph
- N-chromatic graph
- network graph
- net graph
- node-symmetric graph
- object graph
- ordered graph
- oriented graph
- pattern graph
- planar graph
- processing graph
- product graph
- regular graph of degree N
- regular graph
- scene graph
- section graph
- signal-flow graph
- singular graph
- software graph
- spectral decision graph
- stacked bar graph
- stacked graph
- state graph
- strongly connected graph
- task graph
- total graph
- transaction graph
- transition graph
- tree graph
- two-dimensional graph
- undirected graph
- vertex-weighted graph
- weighted directed graph
- word graphEnglish-Russian dictionary of computer science and programming > graph
-
8 graph
1. n график, диаграмма, номограмма; криваяcomputation graph — вычислительный граф; граф вычислений
2. n мат. лингв. графgraph features — свойства графа; теоретико-графовые свойства
product graph — произведение графов; граф-произведение
singular graph — сингулярный граф; вырожденный граф
3. v изображать диаграммой; чертить графики4. v разг. размножать, копировать с помощью гектографаСинонимический ряд:1. chart (noun) bar chart; blueprint; chart; design; diagram; flow chart; linear representation; map; picture; pie chart; plot; table2. diagram (verb) diagram; draw; outline; trace -
9 graph
1. график2. диаграмма; графикcomputation graph — вычислительный граф; граф вычислений
3. чертить графикsingular graph — сингулярный граф; вырожденный граф
regular graph — однородный граф; регулярный граф
-
10 graph
1. график, диаграммаcomputation graph — вычислительный граф; граф вычислений
2. графgraph features — свойства графа; теоретико-графовые свойства
product graph — произведение графов; граф-произведение
singular graph — сингулярный граф; вырожденный граф
3. гидрограф -
11 graph
1) граф2) график || строить график3) диаграмма || чертить диаграмму•- alternating composition graph - arbitrarily transversable graph - derived graph - doubly connected graph - doubly transitive graph - fully connected graph - locally countable graph - locally finite graph - locally restricted graph - log-log graph - partially labeled graph - partially orderable graph - progressively finite graph - regressively finite graph - strictly weak graph - strongly orientable graph - strongly regular graph - strongly rigid graph - strongly singular graph - strongly smooth graph - totally inductive graph - triangleless graph - triply transitive graph - uniquely intersectable graph - uniquely representable graph - weakly disconnected graph -
12 graph
nounграф mbinding number of а graph число m связности графаcircumference of а graph окружность f графаgenus of а graph род m графаgraph coloring раскраска f графаgraph rewrite system система f переписи графовjoin of graphs соединение m графовlabelling of а graph разметка f графаniche graph граф-ниша fАнглийский-русский словарь по теории вероятностей, статистике и комбинаторике > graph
-
13 bar graph
мат. гистограмма, столбчатый графикcomputation graph — вычислительный граф; граф вычислений
-
14 complete graph
graph features — свойства графа; теоретико-графовые свойства
computation graph — вычислительный граф; граф вычислений
product graph — произведение графов; граф-произведение
-
15 extremal graph
graph features — свойства графа; теоретико-графовые свойства
computation graph — вычислительный граф; граф вычислений
product graph — произведение графов; граф-произведение
-
16 information graph
graph features — свойства графа; теоретико-графовые свойства
computation graph — вычислительный граф; граф вычислений
product graph — произведение графов; граф-произведение
-
17 labeled graph
graph features — свойства графа; теоретико-графовые свойства
computation graph — вычислительный граф; граф вычислений
product graph — произведение графов; граф-произведение
-
18 monochromatic graph
graph features — свойства графа; теоретико-графовые свойства
computation graph — вычислительный граф; граф вычислений
product graph — произведение графов; граф-произведение
-
19 net graph
graph features — свойства графа; теоретико-графовые свойства
computation graph — вычислительный граф; граф вычислений
product graph — произведение графов; граф-произведение
-
20 planar graph
планарный граф; плоский графgraph features — свойства графа; теоретико-графовые свойства
computation graph — вычислительный граф; граф вычислений
product graph — произведение графов; граф-произведение
См. также в других словарях:
Graph (mathematics) — This article is about sets of vertices connected by edges. For graphs of mathematical functions, see Graph of a function. For statistical graphs, see Chart. Further information: Graph theory A drawing of a labeled graph on 6 vertices and 7 edges … Wikipedia
Graph theory — In mathematics and computer science, graph theory is the study of graphs : mathematical structures used to model pairwise relations between objects from a certain collection. A graph in this context refers to a collection of vertices or nodes and … Wikipedia
Graph pebbling — is a mathematical game and area of interest played on a graph with pebbles on the vertices. Game play is composed of a series of pebbling moves. A pebbling move on a graph consists of taking two pebbles off one vertex and placing one on an… … Wikipedia
Glossary of graph theory — Graph theory is a growing area in mathematical research, and has a large specialized vocabulary. Some authors use the same word with different meanings. Some authors use different words to mean the same thing. This page attempts to keep up with… … Wikipedia
Vertex cover — In the mathematical discipline of graph theory, a vertex cover of a graph is a set of vertices such that each edge of the graph is incident to at least one vertex of the set. The problem of finding a minimum vertex cover is a classical… … Wikipedia
Graph isomorphism — In graph theory, an isomorphism of graphs G and H is a bijection between the vertex sets of G and H such that any two vertices u and v of G are adjacent in G if and only if ƒ(u) and ƒ(v) are adjacent in H. This kind of bijection is commonly… … Wikipedia
Weighted matroid — In combinatorics, a branch of mathematics, a weighted matroid is a matroid endowed with function with respect to which one can perform a greedy algorithm.There is a simple algorithm for finding a basis:* Let A be the empty set. * For each x in E… … Wikipedia
Graph partition — The graph partitioning problem in mathematics consists of dividing a graph into pieces, such that the pieces are of about the same size and there are few connections between the pieces.Consider a graph G(V,E), where V denotes the set of vertices… … Wikipedia
Matching (graph theory) — In the mathematical discipline of graph theory, a matching or independent edge set in a graph is a set of edges without common vertices. It may also be an entire graph consisting of edges without common vertices. Covering packing dualities… … Wikipedia
Path (graph theory) — In graph theory, a path in a graph is a sequence of vertices such that from each of its vertices there is an edge to the next vertex in the sequence. The first vertex is called the start vertex and the last vertex is called the end vertex . Both… … Wikipedia
Directed graph — A directed graph. A directed graph or digraph is a pair G = (V,A) (sometimes G = (V,E)) of:[1] a set V, whose elements are called vertices or … Wikipedia